A study on using network flows in hierarchical QoS routing

QoS routing is the process of routing a connection based on the connection’s resource requirements. The overhead involved in QoS routing increases with the network size. State aggregation is an important technique that helps to reduce the overhead. In this paper, we propose a new state aggregation technique based on “network-flow”. Our approach allows a domain to update the aggregate sent by other domains and keep track of resource availability in other domains. We study the efficacy of our approach with respect to various network and traffic parameters. Preliminary simulation results show that our approach gives a better bandwidth admission ratio when compared with existing techniques.